Search results for "Graph Theory"
showing 10 items of 784 documents
Monte Carlo simulation of many-arm star polymers in two-dimensional good solvents in the bulk and at a surface
1991
A Monte Carlo technique is proposed for the simulation of statistical properties of many-arm star polymers on lattices. In this vectorizing algorithm, the length of each arml is increased by one, step by step, from a starting configuration withl=1 orl=2 which is generated directly. This procedure is carried out for a large sample (e.g., 100,000 configurations). As an application, we have studied self-avoiding stars on the square lattice with arm lengths up tol max=125 and up tof=20 arms, both in the bulk and in the geometry where the center of the star is adsorbed on a repulsive surface. The total number of configurations, which behaves asN∼l γ G–1μ fl , whereμ=2.6386 is the usual effective…
Three-page encoding and complexity theory for spatial graphs
2004
We construct a series of finitely presented semigroups. The centers of these semigroups encode uniquely up to rigid ambient isotopy in 3-space all non-oriented spatial graphs. This encoding is obtained by using three-page embeddings of graphs into the product of the line with the cone on three points. By exploiting three-page embeddings we introduce the notion of the three-page complexity for spatial graphs. This complexity satisfies the properties of finiteness and additivity under natural operations.
Kernel estimation and display of a five-dimensional conditional intensity function
2018
The aim of this paper is to find a convenient and effective method of displaying some second order properties in a neighbourhood of a selected point of the process. The used techniques are based on very general high-dimensional nonparametric smoothing developed to define a more gen- eral version of the conditional intensity function introduced in earlier earthquake studies by Vere-Jones (1978). 1976) is commonly used for such a purpose in discussing the cumulative behavior of interpoint distances about an initial point. It is defined as the expected number of events falling within a given distance of the initial event, divided by the overall density (rate in 2-dimensions) of the process, sa…
On the maximum efficiency of the propeller mass-ejection mechanism
2007
Aims. We derive simple estimates of the maximum efficiency with which matter can be ejected by the propeller mechanism in disk-fed, rotating magnetic neutron stars. Some binary evolution scenarios envisage that this mechanism is responsible for expelling to infinity the mass inflowing at a low rate from the companion star, therefore limiting the total amount of mass that can be accreted by the neutron star. Methods. We demonstrate that, for typical neutron star parameters, a maximum of ��_{pro} < 5.7 (P_{-3})^{1/3} times more matter than accreted can be expelled through the propeller mechanism at the expenses of the neutron star rotational energy (P_{-3} is the NS spin period in unit of …
The diamond partial order for strong Rickart rings
2016
The diamond partial order has been first introduced for matrices, and then discussed also in the general context of *-regular rings. We extend this notion to Rickart rings, and state various properties of the diamond order living on the so-called strong Rickart rings. In particular, it is compared with the weak space preorder and the star order; also existence of certain meets and joins under diamond order is discussed.
Feasibility of finite and infinite paths in data dependent programs
2005
This paper considers the feasibility of finite and infinite paths in programs in two simple programming languages. The language LBASE allows to express the dependencies of real time systems on integer data, the language LTIM can model quantitative timing constraints in r.t.s. specifications. It is proven that the problem of whether a given LBASE or LTIM program has an infinite feasible path (i.e. whether it can exhibit an infinite behaviour) is decidable. The possibilities to characterise the sets of all feasible finite and infinite paths in LBASE and LTIM programs are also discussed. The infinite feasible path existence problem is proven decidable also for the language LTIBA which has both…
A note on rank 2 diagonals
2020
<p>We solve two questions regarding spaces with a (G<sub>δ</sub>)-diagonal of rank 2. One is a question of Basile, Bella and Ridderbos about weakly Lindelöf spaces with a G<sub>δ</sub>-diagonal of rank 2 and the other is a question of Arhangel’skii and Bella asking whether every space with a diagonal of rank 2 and cellularity continuum has cardinality at most continuum.</p>
Exploring chemical reactivity of complex systems with path-based coordinates: role of the distance metric.
2014
Path-based reaction coordinates constitute a valuable tool for free-energy calculations in complex processes. When a reference path is defined by means of collective variables, a nonconstant distance metric that incorporates the nonorthonormality of these variables should be taken into account. In this work, we show that, accounting for the correct metric tensor, these kind of variables can provide iso-hypersurfaces that coincide with the iso-committor surfaces and that activation free energies equal the value that would be obtained if the committor function itself were used as reaction coordinate. The advantages of the incorporation of the variable metric tensor are illustrated with the an…
Fast Algorithms for Pseudoarboricity
2015
The densest subgraph problem, which asks for a subgraph with the maximum edges-to-vertices ratio d∗, is solvable in polynomial time. We discuss algorithms for this problem and the computation of a graph orientation with the lowest maximum indegree, which is equal to ⌈d∗⌉. This value also equals the pseudoarboricity of the graph. We show that it can be computed in O(|E| √ log log d∗) time, and that better estimates can be given for graph classes where d∗ satisfies certain asymptotic bounds. These runtimes are achieved by accelerating a binary search with an approximation scheme, and a runtime analysis of Dinitz’s algorithm on flow networks where all arcs, except the source and sink arcs, hav…
Inter-Chain Structure Factors of Flexible Polymers in Solutions: A Monte Carlo Investigation
1997
Off-lattice Monte Carlo simulations of both the single chain structure factor h(q) and the inter-chain structure factor HD(q) of flexible polymers in solutions are presented over a wide range of both wavenumber q and concentration c from the dilute to the concentrated regime, for chain lengths up to N = 256. The single chain properties $\{$gyration radius 〈Rg2〉, $h(q)\}$ are in reasonable agreement with the expected theoretical behavior, showing a crossover from swollen chains $\{\langle R_{\rm g}^2\rangle \propto N^{2\nu} ,~ h(q) \propto q^{-1/\nu}\}$ to Gaussian chains, and the data comply with a scaling description, with a correlation length ξ∝c-ν/(3ν-1). However, the inter-chain structu…